GPU-Accelerated Generation of Correctly Rounded Elementary Functions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Hardware Designs for Correctly Rounded Elementary Functions

This paper presents an algorithm for evaluating the functions of reciprocal, square root, 2, and log2(x) with special purpose hardware. For these functions, the algorithm produces correctly rounded results, according to a specified rounding mode. This algorithm can be used to implement directed rounding which is essential for interval arithmetic, or exact rounding which minimizes the maximum er...

متن کامل

Towards Correctly Rounded Transcendentals

The Table Maker’s Dilemma is the problem of always getting correctly rounded results when computing the elementary functions. After a brief presentation of this problem, we present new developments that have helped us to solve this problem for the double-precision exponential function in a small domain. These new results show that this problem can be solved, at least for the double-precision fo...

متن کامل

Fast and correctly rounded logarithms in double-precision

This article is a case study in the implementation of a portable, proven and efficient correctly rounded elementary function in double-precision. We describe the methodology used to achieve these goals in the crlibm library. There are two novel aspects to this approach. The first is the proof framework, and in general the techniques used to balance performance and provability. The second is the...

متن کامل

The abc conjecture and correctly rounded reciprocal square roots

The reciprocal square root calculation = 1= √ x is very common in scienti/c computations. Having a correctly rounded implementation of it is of great importance in producing numerically predictable code among today’s heterogenous computing environment. Existing results suggest that to get the correctly rounded in a 3oating point number system with p signi/cant bits, we may have to compute up to...

متن کامل

Correctly Rounded Binary-Decimal and Decimal-Binary Conversions

This note discusses the main issues in performing correctly rounded decimal-to-binary and binary-to-decimal conversions. It reviews recent work by Clinger and by Steele and White on these conversions and describes some efficiency enhancements. Computational experience with several kinds of arithmetic suggests that the average computational cost for correct rounding can be small for typical conv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Mathematical Software

سال: 2017

ISSN: 0098-3500,1557-7295

DOI: 10.1145/2935746